Informatics Publishing Limited

Gautam J. Kamani , N. N. Jani , P. V. Virparia

Abstract

Once the web site becomes a popular and the access frequency from a large domain of user increase then single web server may not be able to handle high volume of incoming traffic. To provide a better service to all the clients, they need a fully replicated web server clusters. In such an environment, one of the most important issues is that of server selection (and load balancing). In web cluster, load balancing process done at Open Systems Interconnection layer 4 (Hardware Load Balancer) and layer 7 (Software Load Balancer) with typical static and dynamic load balancing approaches. In this paper we present the performance analysis of round robin, random, least connection and new execution time load balancing algorithms at layer 7 in heterogeneous web cluster. The main purpose of this paper is to help in design of new algorithms in future by studying the behavior of various static and dynamic load balancing algorithms.

Keywords

Web Cluster, Load Balancing, Static Load Balancing, Dynamic Load Balancing

Full Text

     

Sandeep R. Vasant ¹, Avani R. Vasant ², N. N. Jani ³, Swapnil S. Marathe ⁴

Affiliations
1 Saurashtra University, Gujarat, IN
2 Shinghania University, Rajasthan, IN
3 S K Patel Institute of Computer Studies, Kadi Sarva Vishwa Vidyalya, Gandhinagar, Gujarat, IN
4 M.S. University, Baroda, Gujarat, IN

Abstract

The human race is facing a large number of very complex real-world problems. One of them is a very common and typical problem faced by many large organizations executing multiple projects concurrently. They have a huge pool of similarly skilled human resource (experts) which needs to be allocated to multiple projects with different units of work and different payment rates such that each expert gets an equitable payment. The above problem is an allocation problem and it falls into the category of NP Hard problems. A simple and obvious approach could be application of Round robin technique to this problem. However, this technique is not suitable and has a set of limitations. As per no polynomial-time algorithm exists to solve this problem optimally. In this paper we have introduced a novel Genetic Algorithm based approach with problem specific three-dimensional representation scheme to find the optimal solution for the equitable payment distribution. We have implemented an algorithm that achieves average performance which is close to the optimal across many experimental scenarios. Furthermore, this evolutionary algorithm does not require special high powered computing hardware and is still quite efficient. This makes it ideally suitable for solving this type of allocation problems.

Keywords

Project, Experts, NP (Non Polynomial), Round Robin, Genetic Algorithm, Exhaustive Search, Elitism, Crossover, Mutation.

Full Text

     

Kamaljit I. Lakhtaria ¹, N. N. Jani ²

Affiliations
1 Atmiya Institute of Technology & Science, Rajkot-360001, Gujarat, IN
2 Kadi Sarva Vishva Vidyalaya (Deemed University), Gandhinagar, Gujarat, IN

Abstract

Next generation networks (NGN) services are assumed to be a new revenue stream for both network operators and service providers. New services especially focused on a mobile telecommunications that would be used not only as a communication de vice but also as a personal gateway to order or consume a variety of services and products. This type of advanced services can be accomplished when the adaptability of the packet-networks (Internet) and the quality of service of the circuit switched networks are combined into one network. New challenges appear in the billing of this heterogeneous multi services network. Some examples of such a services and possible solutions about charging and billing are examined in this paper. The first steps of mathematical model for billing are also considered.

Keywords

AAA, Charging, NGN, Service Creation, UMTS.

Full Text